A first best toll pricing framework for variable demand traffic assignment problems
نویسندگان
چکیده
منابع مشابه
A Toll Pricing Framework for Traffic Assignment Problems with Elastic Demand
This paper extends the notion of toll pricing and the toll pricing framework previously developed for fixed demand traffic assignment [4, 13] to the problem with elastic demand. The system problem maximizes net benefit to the network users [9, 20] and the user problem is the usual one of finding equilibrium with elastic demand. We define and characterize T , the set of all tolls for the user pr...
متن کاملDemand Simulation for Dynamic Traffic Assignment
This paper presents a pre-trip demand simulator with predictive capabilities and an explicit simulation of the response of travelers to real-time pretrip information. The demand simulator is an extension of dynamic OD estimation models aimed at explicitly capturing the effect of information on demand. This is achieved by explicitly simulating driver behavior in response to both descriptive and ...
متن کاملRisk-Neutral Second Best Toll Pricing
We propose a risk-neutral second best toll pricing scheme to account for the possible nonuniqueness of user equilibrium solutions. The scheme is designed to optimize for the expected objective value as the UE solution varies within the solution set. We show that such a risk-neutral scheme can be formulated as a stochastic program, which complements the traditional risk-prone second best toll pr...
متن کاملRisk Taking in Second-Best Toll Pricing
The Second-Best Toll Pricing (SBTP) problem aims to determine an optimal toll scheme for a given set of links in a transportation network so that traffic can be distributed more efficiently from the system point of view. SBTP can be further categorized as static SBTP or dynamic SBTP (DSBTP), depending on whether traffic dynamics are considered or not. In this paper, we focus on the static SBTP ...
متن کاملExact Algorithms for Unit Demand Pricing Problems
For my final project I study the (nonparametric) unit demand pricing problem from a parametrized perspective. For instances with n items and m customers we give O(m) and O(n) algorithms respectively. We then investigate a price restricted variant of UDP called UDP-PS, and show the problem is fixed parameter tractable when the parameter is the number of customers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B: Methodological
سال: 2005
ISSN: 0191-2615
DOI: 10.1016/j.trb.2004.08.001